{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5RGHYHF2EUJELZCD47CZZG7W6J","short_pith_number":"pith:5RGHYHF2","schema_version":"1.0","canonical_sha256":"ec4c7c1cba251245e443e7c59c9bf6f24b94459b093b7ef12c7b81067d65daf2","source":{"kind":"arxiv","id":"2309.14595","version":2},"attestation_state":"computed","paper":{"title":"Neural Informed RRT*: Learning-based Path Planning with Point Cloud State Representations under Admissible Ellipsoidal Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hongyu Chen, John Pohovey, Katherine Driggs-Campbell, Zhe Huang","submitted_at":"2023-09-26T01:00:02Z","abstract_excerpt":"Sampling-based planning algorithms like Rapidly-exploring Random Tree (RRT) are versatile in solving path planning problems. RRT* offers asymptotic optimality but requires growing the tree uniformly over the free space, which leaves room for efficiency improvement. To accelerate convergence, rule-based informed approaches sample states in an admissible ellipsoidal subset of the space determined by the current path cost. Learning-based alternatives model the topology of the free space and infer the states close to the optimal path to guide planning. We propose Neural Informed RRT* to combine th"},"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":"2309.14595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-26T01:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"d862def856a992422860195d3496ce69f63174bebcd0621ba970278d89ce3784","abstract_canon_sha256":"48defb3a2f86ccf4696de1ee28ecdebc9e493e6a0d046248a6d8652d1d384a01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:10.725299Z","signature_b64":"HwxcDBk0TUfmr+XEtQtD5nLSxomn1kg/X5s6bkt8Wlq8vZN0wIpMZew88P4wPI1D57X25jVbzjMYgIjqH8cFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec4c7c1cba251245e443e7c59c9bf6f24b94459b093b7ef12c7b81067d65daf2","last_reissued_at":"2026-07-05T07:53:10.724886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:10.724886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Informed RRT*: Learning-based Path Planning with Point Cloud State Representations under Admissible Ellipsoidal Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hongyu Chen, John Pohovey, Katherine Driggs-Campbell, Zhe Huang","submitted_at":"2023-09-26T01:00:02Z","abstract_excerpt":"Sampling-based planning algorithms like Rapidly-exploring Random Tree (RRT) are versatile in solving path planning problems. RRT* offers asymptotic optimality but requires growing the tree uniformly over the free space, which leaves room for efficiency improvement. To accelerate convergence, rule-based informed approaches sample states in an admissible ellipsoidal subset of the space determined by the current path cost. Learning-based alternatives model the topology of the free space and infer the states close to the optimal path to guide planning. We propose Neural Informed RRT* to combine th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14595","kind":"arxiv","version":2},"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/2309.14595/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":"2309.14595","created_at":"2026-07-05T07:53:10.724945+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.14595v2","created_at":"2026-07-05T07:53:10.724945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14595","created_at":"2026-07-05T07:53:10.724945+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RGHYHF2EUJE","created_at":"2026-07-05T07:53:10.724945+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RGHYHF2EUJELZCD","created_at":"2026-07-05T07:53:10.724945+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RGHYHF2","created_at":"2026-07-05T07:53:10.724945+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06221","citing_title":"Interaction-aware Conformal Prediction for Crowd Navigation","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J","json":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J.json","graph_json":"https://pith.science/api/pith-number/5RGHYHF2EUJELZCD47CZZG7W6J/graph.json","events_json":"https://pith.science/api/pith-number/5RGHYHF2EUJELZCD47CZZG7W6J/events.json","paper":"https://pith.science/paper/5RGHYHF2"},"agent_actions":{"view_html":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J","download_json":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J.json","view_paper":"https://pith.science/paper/5RGHYHF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.14595&json=true","fetch_graph":"https://pith.science/api/pith-number/5RGHYHF2EUJELZCD47CZZG7W6J/graph.json","fetch_events":"https://pith.science/api/pith-number/5RGHYHF2EUJELZCD47CZZG7W6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J/action/storage_attestation","attest_author":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J/action/author_attestation","sign_citation":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J/action/citation_signature","submit_replication":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J/action/replication_record"}},"created_at":"2026-07-05T07:53:10.724945+00:00","updated_at":"2026-07-05T07:53:10.724945+00:00"}