{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5ZH4PLELNUSCWK3KG2HRAQVLUN","short_pith_number":"pith:5ZH4PLEL","schema_version":"1.0","canonical_sha256":"ee4fc7ac8b6d242b2b6a368f1042aba34e1f3b6d0f6f639c0ec3592a092828e3","source":{"kind":"arxiv","id":"2504.05550","version":1},"attestation_state":"computed","paper":{"title":"Path Database Guidance for Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Amnon Attali, Marco Morales, Nancy M. Amato, Praval Telagi","submitted_at":"2025-04-07T23:00:31Z","abstract_excerpt":"One approach to using prior experience in robot motion planning is to store solutions to previously seen problems in a database of paths. Methods that use such databases are characterized by how they query for a path and how they use queries given a new problem. In this work we present a new method, Path Database Guidance (PDG), which innovates on existing work in two ways. First, we use the database to compute a heuristic for determining which nodes of a search tree to expand, in contrast to prior work which generally pastes the (possibly transformed) queried path or uses it to bias a samplin"},"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":"2504.05550","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-04-07T23:00:31Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5619e6a525206f8d1810df20ca7977550c535c458ba584fca4c8fe05c3fffebe","abstract_canon_sha256":"351ca8f41c185d3176320c2dd2e51add53585de14a72de24f136d7849c2ddc32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:05.645074Z","signature_b64":"BWF4fmoOBhfj/jC37HHpkWZtNlydYQCL7/Fae5qvOHBC6p1k2xj1tNd0vrM5EC7KfHmmJQje9obGLSpFK3t0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee4fc7ac8b6d242b2b6a368f1042aba34e1f3b6d0f6f639c0ec3592a092828e3","last_reissued_at":"2026-07-05T10:46:05.644586Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:05.644586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Database Guidance for Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Amnon Attali, Marco Morales, Nancy M. Amato, Praval Telagi","submitted_at":"2025-04-07T23:00:31Z","abstract_excerpt":"One approach to using prior experience in robot motion planning is to store solutions to previously seen problems in a database of paths. Methods that use such databases are characterized by how they query for a path and how they use queries given a new problem. In this work we present a new method, Path Database Guidance (PDG), which innovates on existing work in two ways. First, we use the database to compute a heuristic for determining which nodes of a search tree to expand, in contrast to prior work which generally pastes the (possibly transformed) queried path or uses it to bias a samplin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05550","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/2504.05550/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":"2504.05550","created_at":"2026-07-05T10:46:05.644645+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.05550v1","created_at":"2026-07-05T10:46:05.644645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05550","created_at":"2026-07-05T10:46:05.644645+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZH4PLELNUSC","created_at":"2026-07-05T10:46:05.644645+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZH4PLELNUSCWK3K","created_at":"2026-07-05T10:46:05.644645+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZH4PLEL","created_at":"2026-07-05T10:46:05.644645+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/5ZH4PLELNUSCWK3KG2HRAQVLUN","json":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN.json","graph_json":"https://pith.science/api/pith-number/5ZH4PLELNUSCWK3KG2HRAQVLUN/graph.json","events_json":"https://pith.science/api/pith-number/5ZH4PLELNUSCWK3KG2HRAQVLUN/events.json","paper":"https://pith.science/paper/5ZH4PLEL"},"agent_actions":{"view_html":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN","download_json":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN.json","view_paper":"https://pith.science/paper/5ZH4PLEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.05550&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZH4PLELNUSCWK3KG2HRAQVLUN/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZH4PLELNUSCWK3KG2HRAQVLUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/action/storage_attestation","attest_author":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/action/author_attestation","sign_citation":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/action/citation_signature","submit_replication":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/action/replication_record"}},"created_at":"2026-07-05T10:46:05.644645+00:00","updated_at":"2026-07-05T10:46:05.644645+00:00"}