{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5ZH4PLELNUSCWK3KG2HRAQVLUN","short_pith_number":"pith:5ZH4PLEL","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"},"canonical_sha256":"ee4fc7ac8b6d242b2b6a368f1042aba34e1f3b6d0f6f639c0ec3592a092828e3","source":{"kind":"arxiv","id":"2504.05550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.05550","created_at":"2026-07-05T10:46:05Z"},{"alias_kind":"arxiv_version","alias_value":"2504.05550v1","created_at":"2026-07-05T10:46:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05550","created_at":"2026-07-05T10:46:05Z"},{"alias_kind":"pith_short_12","alias_value":"5ZH4PLELNUSC","created_at":"2026-07-05T10:46:05Z"},{"alias_kind":"pith_short_16","alias_value":"5ZH4PLELNUSCWK3K","created_at":"2026-07-05T10:46:05Z"},{"alias_kind":"pith_short_8","alias_value":"5ZH4PLEL","created_at":"2026-07-05T10:46:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5ZH4PLELNUSCWK3KG2HRAQVLUN","target":"record","payload":{"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"},"canonical_sha256":"ee4fc7ac8b6d242b2b6a368f1042aba34e1f3b6d0f6f639c0ec3592a092828e3","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"},"source_kind":"arxiv","source_id":"2504.05550","source_version":1,"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-05T10:46:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6DtKxqWnRMrYG0FGOrjiBr99/txqZ647MpHBBM553mVnBp+FsmHsZLLi4L0sWUxibjV0nIbApeXB/c/87ljFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:04:24.672303Z"},"content_sha256":"29736823bd3a405c6cd42a6b8e688e1156ea6d091e701330ce9afb805b27f4b6","schema_version":"1.0","event_id":"sha256:29736823bd3a405c6cd42a6b8e688e1156ea6d091e701330ce9afb805b27f4b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5ZH4PLELNUSCWK3KG2HRAQVLUN","target":"graph","payload":{"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"},"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-05T10:46:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phAoo4ghvR3mfKrAQH5Xkg/53Gw8Z8s7BSCcxSnRgK8w1Xm16q7rOyVUgSADx2wftLb6/QEiYv1xeIBntRPxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:04:24.672846Z"},"content_sha256":"1054a4af06eba34e4d55c172ab1fe1b0beb32e815b6e593c179ce8eb6e424f56","schema_version":"1.0","event_id":"sha256:1054a4af06eba34e4d55c172ab1fe1b0beb32e815b6e593c179ce8eb6e424f56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/bundle.json","state_url":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/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-08-04T10:04:24Z","links":{"resolver":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN","bundle":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/bundle.json","state":"https://pith.science/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZH4PLELNUSCWK3KG2HRAQVLUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5ZH4PLELNUSCWK3KG2HRAQVLUN","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":"351ca8f41c185d3176320c2dd2e51add53585de14a72de24f136d7849c2ddc32","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-04-07T23:00:31Z","title_canon_sha256":"5619e6a525206f8d1810df20ca7977550c535c458ba584fca4c8fe05c3fffebe"},"schema_version":"1.0","source":{"id":"2504.05550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.05550","created_at":"2026-07-05T10:46:05Z"},{"alias_kind":"arxiv_version","alias_value":"2504.05550v1","created_at":"2026-07-05T10:46:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05550","created_at":"2026-07-05T10:46:05Z"},{"alias_kind":"pith_short_12","alias_value":"5ZH4PLELNUSC","created_at":"2026-07-05T10:46:05Z"},{"alias_kind":"pith_short_16","alias_value":"5ZH4PLELNUSCWK3K","created_at":"2026-07-05T10:46:05Z"},{"alias_kind":"pith_short_8","alias_value":"5ZH4PLEL","created_at":"2026-07-05T10:46:05Z"}],"graph_snapshots":[{"event_id":"sha256:1054a4af06eba34e4d55c172ab1fe1b0beb32e815b6e593c179ce8eb6e424f56","target":"graph","created_at":"2026-07-05T10:46:05Z","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/2504.05550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amnon Attali, Marco Morales, Nancy M. Amato, Praval Telagi","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-04-07T23:00:31Z","title":"Path Database Guidance for Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05550","kind":"arxiv","version":1},"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:29736823bd3a405c6cd42a6b8e688e1156ea6d091e701330ce9afb805b27f4b6","target":"record","created_at":"2026-07-05T10:46:05Z","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":"351ca8f41c185d3176320c2dd2e51add53585de14a72de24f136d7849c2ddc32","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-04-07T23:00:31Z","title_canon_sha256":"5619e6a525206f8d1810df20ca7977550c535c458ba584fca4c8fe05c3fffebe"},"schema_version":"1.0","source":{"id":"2504.05550","kind":"arxiv","version":1}},"canonical_sha256":"ee4fc7ac8b6d242b2b6a368f1042aba34e1f3b6d0f6f639c0ec3592a092828e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee4fc7ac8b6d242b2b6a368f1042aba34e1f3b6d0f6f639c0ec3592a092828e3","first_computed_at":"2026-07-05T10:46:05.644586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:46:05.644586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BWF4fmoOBhfj/jC37HHpkWZtNlydYQCL7/Fae5qvOHBC6p1k2xj1tNd0vrM5EC7KfHmmJQje9obGLSpFK3t0AA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:46:05.645074Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.05550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29736823bd3a405c6cd42a6b8e688e1156ea6d091e701330ce9afb805b27f4b6","sha256:1054a4af06eba34e4d55c172ab1fe1b0beb32e815b6e593c179ce8eb6e424f56"],"state_sha256":"9c2c65c36ee4e5138ea43353ec8b271848bf393de91adacfbe993b9118c226a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opMQ/vtp3Na54LpKtrpsPIGDbs5zr/qzOEx7i7SS8YDTocgixnNu0u8UpitDY8f3UzRvM/Rk3uojVBgQYnr+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T10:04:24.676432Z","bundle_sha256":"40faa83b8b461c9ff19995cdf9310e741f23c1bfe0ab57e6f412e1d698fee279"}}