{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5RGHYHF2EUJELZCD47CZZG7W6J","short_pith_number":"pith:5RGHYHF2","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"},"canonical_sha256":"ec4c7c1cba251245e443e7c59c9bf6f24b94459b093b7ef12c7b81067d65daf2","source":{"kind":"arxiv","id":"2309.14595","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.14595","created_at":"2026-07-05T07:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"2309.14595v2","created_at":"2026-07-05T07:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14595","created_at":"2026-07-05T07:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"5RGHYHF2EUJE","created_at":"2026-07-05T07:53:10Z"},{"alias_kind":"pith_short_16","alias_value":"5RGHYHF2EUJELZCD","created_at":"2026-07-05T07:53:10Z"},{"alias_kind":"pith_short_8","alias_value":"5RGHYHF2","created_at":"2026-07-05T07:53:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5RGHYHF2EUJELZCD47CZZG7W6J","target":"record","payload":{"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"},"canonical_sha256":"ec4c7c1cba251245e443e7c59c9bf6f24b94459b093b7ef12c7b81067d65daf2","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"},"source_kind":"arxiv","source_id":"2309.14595","source_version":2,"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-05T07:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"exBcj09N1TxYw47DX5OBi+111rNgZngvtwRNZkOpZMrwNu74coYvwUQbcp0Y+Im+KSnNvAPKOaFApcxAHjbrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:18:17.434731Z"},"content_sha256":"301b73a236d0e21afd951f0caada5647230f1a55edeaab4324b03543814c0bbe","schema_version":"1.0","event_id":"sha256:301b73a236d0e21afd951f0caada5647230f1a55edeaab4324b03543814c0bbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5RGHYHF2EUJELZCD47CZZG7W6J","target":"graph","payload":{"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"},"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-05T07:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dl4PV0Rdp8U5cE6zGbJ8GVOW0SjvTQxETIz0sJxuCk/jGStPpzSNejpgSlUFz8D3eGsUWxlKD69FgNWkR8WnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:18:17.435678Z"},"content_sha256":"733063a5171f8042c3aee01c186a21a2c601a7e2ffb6db25c6a3a1898003937a","schema_version":"1.0","event_id":"sha256:733063a5171f8042c3aee01c186a21a2c601a7e2ffb6db25c6a3a1898003937a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J/bundle.json","state_url":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RGHYHF2EUJELZCD47CZZG7W6J/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-18T08:18:17Z","links":{"resolver":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J","bundle":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J/bundle.json","state":"https://pith.science/pith/5RGHYHF2EUJELZCD47CZZG7W6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RGHYHF2EUJELZCD47CZZG7W6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5RGHYHF2EUJELZCD47CZZG7W6J","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":"48defb3a2f86ccf4696de1ee28ecdebc9e493e6a0d046248a6d8652d1d384a01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-26T01:00:02Z","title_canon_sha256":"d862def856a992422860195d3496ce69f63174bebcd0621ba970278d89ce3784"},"schema_version":"1.0","source":{"id":"2309.14595","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.14595","created_at":"2026-07-05T07:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"2309.14595v2","created_at":"2026-07-05T07:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14595","created_at":"2026-07-05T07:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"5RGHYHF2EUJE","created_at":"2026-07-05T07:53:10Z"},{"alias_kind":"pith_short_16","alias_value":"5RGHYHF2EUJELZCD","created_at":"2026-07-05T07:53:10Z"},{"alias_kind":"pith_short_8","alias_value":"5RGHYHF2","created_at":"2026-07-05T07:53:10Z"}],"graph_snapshots":[{"event_id":"sha256:733063a5171f8042c3aee01c186a21a2c601a7e2ffb6db25c6a3a1898003937a","target":"graph","created_at":"2026-07-05T07:53:10Z","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/2309.14595/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hongyu Chen, John Pohovey, Katherine Driggs-Campbell, Zhe Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-26T01:00:02Z","title":"Neural Informed RRT*: Learning-based Path Planning with Point Cloud State Representations under Admissible Ellipsoidal Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14595","kind":"arxiv","version":2},"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:301b73a236d0e21afd951f0caada5647230f1a55edeaab4324b03543814c0bbe","target":"record","created_at":"2026-07-05T07:53:10Z","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":"48defb3a2f86ccf4696de1ee28ecdebc9e493e6a0d046248a6d8652d1d384a01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-26T01:00:02Z","title_canon_sha256":"d862def856a992422860195d3496ce69f63174bebcd0621ba970278d89ce3784"},"schema_version":"1.0","source":{"id":"2309.14595","kind":"arxiv","version":2}},"canonical_sha256":"ec4c7c1cba251245e443e7c59c9bf6f24b94459b093b7ef12c7b81067d65daf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec4c7c1cba251245e443e7c59c9bf6f24b94459b093b7ef12c7b81067d65daf2","first_computed_at":"2026-07-05T07:53:10.724886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:53:10.724886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HwxcDBk0TUfmr+XEtQtD5nLSxomn1kg/X5s6bkt8Wlq8vZN0wIpMZew88P4wPI1D57X25jVbzjMYgIjqH8cFAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:53:10.725299Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.14595","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:301b73a236d0e21afd951f0caada5647230f1a55edeaab4324b03543814c0bbe","sha256:733063a5171f8042c3aee01c186a21a2c601a7e2ffb6db25c6a3a1898003937a"],"state_sha256":"fa11efe80f4eff70c8defef0794bced267c1564944c7d3f66518f2373165db74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5EGkFsX7Q7aae//bZMBFUaP24Ed0b+vwHXdm8IuEE4HMvqW/dtvvued5GLRh2h110PIs5btludVOkYhPnbhvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:18:17.443998Z","bundle_sha256":"cf382be9f038215bc42151a4df6c39d2adac90a084f258c0b77d09a79be084df"}}