{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5M7EADNMBYFRIDRGCJGASMVGYY","short_pith_number":"pith:5M7EADNM","schema_version":"1.0","canonical_sha256":"eb3e400dac0e0b140e26124c0932a6c6391e3331afd0996587f077b735054a77","source":{"kind":"arxiv","id":"2205.08480","version":3},"attestation_state":"computed","paper":{"title":"Effort Informed Roadmaps (EIRM*): Efficient Asymptotically Optimal Multiquery Planning by Actively Reusing Validation Effort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jonathan D. Gammell, Marc Toussaint, Marlin P. Strub, Valentin N. Hartmann","submitted_at":"2022-05-17T16:44:55Z","abstract_excerpt":"Multiquery planning algorithms find paths between various different starts and goals in a single search space. They are designed to do so efficiently by reusing information across planning queries. This information may be computed before or during the search and often includes knowledge of valid paths. Using known valid paths to solve an individual planning query takes less computational effort than finding a completely new solution. This allows multiquery algorithms, such as PRM*, to outperform single-query algorithms, such as RRT*, on many problems but their relative performance depends on h"},"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":"2205.08480","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-17T16:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"74c7148315c93e942296833d9feb00a3649b1c254da6e532008687ea78839a70","abstract_canon_sha256":"669f9df376257a671c96e2a21bec89b313a9907d6bb3475d65fe3ae48da638ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:28.180735Z","signature_b64":"lL0NfKN7idb8ISwflf/nI/n5ePCJIH8h3sh5WpogHLsg8/Pr96/jEKNS/77zp3EOtMo9JJWcRHdu0nrVDS/oBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb3e400dac0e0b140e26124c0932a6c6391e3331afd0996587f077b735054a77","last_reissued_at":"2026-07-05T06:02:28.180207Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:28.180207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effort Informed Roadmaps (EIRM*): Efficient Asymptotically Optimal Multiquery Planning by Actively Reusing Validation Effort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jonathan D. Gammell, Marc Toussaint, Marlin P. Strub, Valentin N. Hartmann","submitted_at":"2022-05-17T16:44:55Z","abstract_excerpt":"Multiquery planning algorithms find paths between various different starts and goals in a single search space. They are designed to do so efficiently by reusing information across planning queries. This information may be computed before or during the search and often includes knowledge of valid paths. Using known valid paths to solve an individual planning query takes less computational effort than finding a completely new solution. This allows multiquery algorithms, such as PRM*, to outperform single-query algorithms, such as RRT*, on many problems but their relative performance depends on h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08480","kind":"arxiv","version":3},"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.08480/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":"2205.08480","created_at":"2026-07-05T06:02:28.180281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.08480v3","created_at":"2026-07-05T06:02:28.180281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08480","created_at":"2026-07-05T06:02:28.180281+00:00"},{"alias_kind":"pith_short_12","alias_value":"5M7EADNMBYFR","created_at":"2026-07-05T06:02:28.180281+00:00"},{"alias_kind":"pith_short_16","alias_value":"5M7EADNMBYFRIDRG","created_at":"2026-07-05T06:02:28.180281+00:00"},{"alias_kind":"pith_short_8","alias_value":"5M7EADNM","created_at":"2026-07-05T06:02:28.180281+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/5M7EADNMBYFRIDRGCJGASMVGYY","json":"https://pith.science/pith/5M7EADNMBYFRIDRGCJGASMVGYY.json","graph_json":"https://pith.science/api/pith-number/5M7EADNMBYFRIDRGCJGASMVGYY/graph.json","events_json":"https://pith.science/api/pith-number/5M7EADNMBYFRIDRGCJGASMVGYY/events.json","paper":"https://pith.science/paper/5M7EADNM"},"agent_actions":{"view_html":"https://pith.science/pith/5M7EADNMBYFRIDRGCJGASMVGYY","download_json":"https://pith.science/pith/5M7EADNMBYFRIDRGCJGASMVGYY.json","view_paper":"https://pith.science/paper/5M7EADNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.08480&json=true","fetch_graph":"https://pith.science/api/pith-number/5M7EADNMBYFRIDRGCJGASMVGYY/graph.json","fetch_events":"https://pith.science/api/pith-number/5M7EADNMBYFRIDRGCJGASMVGYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5M7EADNMBYFRIDRGCJGASMVGYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5M7EADNMBYFRIDRGCJGASMVGYY/action/storage_attestation","attest_author":"https://pith.science/pith/5M7EADNMBYFRIDRGCJGASMVGYY/action/author_attestation","sign_citation":"https://pith.science/pith/5M7EADNMBYFRIDRGCJGASMVGYY/action/citation_signature","submit_replication":"https://pith.science/pith/5M7EADNMBYFRIDRGCJGASMVGYY/action/replication_record"}},"created_at":"2026-07-05T06:02:28.180281+00:00","updated_at":"2026-07-05T06:02:28.180281+00:00"}